Block-Arnoldi and Davidson methods for unsymmetric large eigenvalue problems
نویسندگان
چکیده
منابع مشابه
Arnoldi and Jacobi - Davidson methods for generalized eigenvalue problems
In many physical situations, a few specific eigenvalues of a large sparse generalized eigenvalue problem Ax = λBx are needed. If exact linear solves with A − σB are available, implicitly restarted Arnoldi with purification is a common approach for problems where B is positive semidefinite. In this paper, a new approach based on implicitly restarted Arnoldi will be presented that avoids most of ...
متن کاملArnoldi and Jacobi-Davidson methods for generalized eigenvalue problems Ax=λBx with singular B
In many physical situations, a few specific eigenvalues of a large sparse generalized eigenvalue problem Ax = λBx are needed. If exact linear solves with A−σB are available, implicitly restarted Arnoldi with purification is a common approach for problems where B is positive semidefinite. In this paper, a new approach based on implicitly restarted Arnoldi will be presented that avoids most of th...
متن کاملJacobi-Davidson methods for cubic eigenvalue problems
Several Jacobi–Davidson type methods are proposed for computing interior eigenpairs of large-scale cubic eigenvalue problems. To successively compute the eigenpairs, a novel explicit non-equivalence de ation method with low-rank updates is developed and analysed. Various techniques such as locking, search direction transformation, restarting, and preconditioning are incorporated into the method...
متن کاملA block Chebyshev-Davidson method for linear response eigenvalue problems
We present a Chebyshev-Davidson method to compute a few smallest positive eigenvalues and corresponding eigenvectors of the linear response eigenvalue problem. The method is actually applicable to the slightly more general linear response eigenvalue problem where purely imaginary eigenvalues may occur. For the Chebyshev filter, a tight upper bound is obtained by a computable bound estimator con...
متن کاملArnoldi-Faber method for large non hermitian eigenvalue problems
We propose a restarted Arnoldi’s method with Faber polynomials and discuss its use for computing the rightmost eigenvalues of large non hermitian matrices. We illustrate, with the help of some practical test problems, the benefit obtained from the Faber acceleration by comparing this method with the Chebyshev based acceleration. A comparison with the implicitly restarted Arnoldi method is also ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Numerische Mathematik
سال: 1993
ISSN: 0029-599X,0945-3245
DOI: 10.1007/bf01388687